A Single-File Version of Linear Hashing with Partial Expansions
نویسنده
چکیده
Linear hashing with partial expansions is a file organization intended for dynamic files. In this paper an improved version of the method is presented. Instead of having a separate overflow area, the storage area for overflow records is incorporated into the main file. Hence, all the records are stored in one file which grows and shrinks according to the number of records stored. By using several overflow chains per page, the retrieval performance is further improved. The expected performance of the new scheme is studied by means of a few examples.
منابع مشابه
Unified Dynamic Hashing
This paper attempts to unify a variety of dynamic hashing methods. Spiral storage, linear hashing and to a certain extent, linear hashing with partial expansions can be seen as particular cases of a more general technique. The approach is closest to spiral storage in concept. A new instantiation of the general method is offered which permits an adjustment to the dynamic growth rate during expan...
متن کاملPLOP-Hashing: A Grid File without Directory
In this paper we consider the case of nonuniform weakly correlated or independent multidimensional record distributions. After demonstrating the advantages of multidimensional hashing schemes without directory, we suggest piecewise linear expansions in order to distribute the load more evenly over the pages of the file. The resuiting piecewise linear order preserving hashing scheme (PLOP-Hashin...
متن کاملMultidimensional Order Preserving Linear Hashing with Partial Expansions
We present a new multidimensional dynamic hashing scheme without directory intended for files which grow and shrink dynamically. For previous schemes, the retrieval performance either suffers from a superlinearly growing directory or from an uneven distribution of the records over the pages of a file even for uniform record distribution. Our scheme is a multidimensional order preserving extensi...
متن کاملPerformance of Linear Hashing Schemes for Primary Key Retrieval
Linear hashing is one of the most attractive dynamic hashing schemes. Linear hashing with partial expansions and linear hashing with priority splitting are two variations with improved space and time performance. Here, we propose a new structure, which is termed linear hashing with partial expansions and priority splitting. The above four structures are compared by simulation and it is shown th...
متن کاملIH* : A New Hash-Based Multidimensional SDDS
Classic one-dimensional data structures are very important. Nevertheless, the new data management systems (CAD, Web,..) need new access methods that support efficiently spatial operations on multi-attributes (multidimensional ) data files. Scalable Distributed Data Structures (SDDS) is a new class of data structures conceived specially for multicomputers: collection of PCs and workstations inte...
متن کامل